Offline Signature Verification System with Gaussian Mixture Models (GMM)

نویسندگان

  • Charu Jain
  • Priti Singh
  • Preeti Rana
چکیده

Gaussian Mixture Models (GMMs) has been proposed for off-line signature verification. The individual Gaussian components are shown to represent some global features such as skewness, kurtosis, etc. that characterize various aspects of a signature, and are effective for modeling its specificity. The learning phase involves the use of Gaussian Mixture Model (GMM) technique to build a reference model for each signature sample of a particular user. The verification phase uses three layers of statistical techniques. The first layer involves computation of GMM-based loglikelihood probability match score, second layer performs the mapping of this score into soft boundary ranges of acceptance or rejection through the use of z-score analysis and normalization function, thirdly, threshold is used to arrive at the final decision of accepting or rejecting a given signature sample. The focus of this work is on faster detection of authenticated signature as no vector analysis is done in GMM. From the experimental results, the new features proved to be more robust than other related features used in the earlier systems. The FAR (False Acceptance Rate) and FRR (False Rejection Rate) for the genuine samples is 0.15 and 0.19 respectively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Use of the Shearlet Transform and Transfer Learning in Offline Handwritten Signature Verification and Recognition

Despite the growing growth of technology, handwritten signature has been selected as the first option between biometrics by users. In this paper, a new methodology for offline handwritten signature verification and recognition based on the Shearlet transform and transfer learning is proposed. Since, a large percentage of handwritten signatures are composed of curves and the performance of a sig...

متن کامل

Off-Line Writer Verification: A Comparison of a Hidden Markov Model (HMM) and a Gaussian Mixture Model (GMM) Based System

In this paper, we introduce and compare two off-line, text independent writer verification systems. At the core of the first system are Hidden Markov Model (HMM) based recognizers. The second system uses Gaussian Mixture Models (GMMs) to model a person’s handwriting. Both systems are evaluated on two test sets consisting of unskillfully forged and skillfully forged text lines, respectively. In ...

متن کامل

The Robustness of GMM-SVM in Real World Applied to Speaker Verification

Gaussian mixture models (GMMs) have proven extremely successful for textindependent speaker verification. The standard training method for GMM models is to use MAP adaptation of the means of the mixture components based on speech from a target speaker. In this work we look into the various models (GMM-UBM and GMM-SVM) and their application to speaker verification. In this paper, features vector...

متن کامل

Speaker Verification System Using Gaussian Mixture Model & UBM

In This paper presents an overview of a stateof-the-art text-independent speaker verification system. The objective of automatic speaker recognition is to extract, characterize and recognize the information about speaker identity. First, an introduction proposes a modular scheme of the training and test phases of a speaker verification system. Then, the most commonly speech parameterization use...

متن کامل

Learning to boost GMM based speaker verification

The Gaussian mixture models (GMM) has proved to be an effective probabilistic model for speaker verification, and has been widely used in most of state-of-the-art systems. In this paper, we introduce a new method for the task: that using AdaBoost learning based on the GMM. The motivation is the following: While a GMM linearly combines a number of Gaussian models according to a set of mixing wei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013